515. Find Largest Value in Each Tree Row - LeetCode Solution

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def largestValues(self, root: TreeNode) -> List[int]:
        q = [root, None]
        
        count = 0
        
        ans =  []
        s = []
        
        while len(q) != 0:
            k = q.pop(0)
            
            if k== None:
                count+=1
                
                if count == 2:
                    break
                else:
                    
                    if len(s) != 0:
                        ans.append(max(s))
                    s = []
                    
                    q.append(None)
                    
                continue
            count = 0
            if k.right:
                q.append(k.right)
                
            if k.left:
                q.append(k.left)
                
            s.append(k.val)
            
        
        return ans